An economical transformation of graph grammars
نویسندگان
چکیده
منابع مشابه
Matrix Graph Grammars: Transformation of Restrictions
In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operations only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, stated reachability and the minimal digraph able to fire a sequence. See [19] for a...
متن کاملSpatial graph grammars for web information transformation
This paper presents an approach to spatial specifications for Web information transformation. Extended from the Reserved Graph Grammar (RGG), a Spatial Graph Grammar (SGG) is proposed. The paper illustrates a detailed example that applies the SGG to transform a XML Web document to a WML structure for the display on mobile devices. The SGG formalism is general enough for a wide range of applicat...
متن کاملTriple Graph Grammars or Triple Graph Transformation Systems?
Triple graph grammars have been used to specify consistency maintenance between inter-dependent and evolving models at a high level of abstraction. On a lower level, consistency maintenance may be specified by a triple graph transformation system, which takes care of all operational details required for executing consistency maintenance operations. We present a case study from software configur...
متن کاملEconomical Graph Discovery
Consider a weighted n-vertex, m-edge graph G with designated source s and destination t. The topology of G is known, while the edge weights are hidden. Our goal is to discover either the edge weights in the graph or a shortest (s, t)-path. This is done by means of agents that traverse different (s, t)-paths in multiple rounds and report back the total cost they incurred. Various cost models are...
متن کاملBidirectional Model Transformation with Precedence Triple Graph Grammars
Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation. In practical scenarios, the unidirectional rules needed for the forward and backward transformations are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1993
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1993270403111